Traffic Flow and Efficient Routing on Scale-Free Networks: A Survey
نویسندگان
چکیده
منابع مشابه
Traffic Flow and Efficient Routing on Scale-Free Networks: A Survey
Recently, motivated by the pioneering that have revealed the small-world effect and scale-free property of various real-life networks, many scientists are devoting themselves to studying complex networks. In this paper, we give a brief review of studies on traffic flow and efficient routing on scale-free networks, including traffic dynamics based on the global routing protocol, traffic dynamics...
متن کاملTraffic Properties for Stochastic Routing on Scale-Free Networks
For realistic scale-free networks, we investigate the traffic properties of stochastic routing inspired by a zero-range process known in statistical physics. By parameters α and δ, this model controls degree-dependent hopping of packets and forwarding of packets with higher performance at more busy nodes. Through a theoretical analysis and numerical simulations, we derive the condition for the ...
متن کاملEfficient and robust routing on scale-free networks
Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy ismore efficient than the shortest path al...
متن کاملEfficient routing on scale-free networks based on local information
In this letter, we propose a new routing strategy with a single free parameter α only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. By investigating the distributions of queue le...
متن کاملImproved routing strategies for data traffic in scale-free networks
We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korean Physical Society
سال: 2007
ISSN: 0374-4884
DOI: 10.3938/jkps.50.134